Merge decompositions, two-sided Krohn-Rhodes, and aperiodic pointlikes
نویسندگان
چکیده
This paper provides short proofs of two fundamental theorems of finite semigroup theory whose previous proofs were significantly longer, namely the two-sided Krohn-Rhodes decomposition theorem and Henckell's aperiodic pointlike theorem, using a new algebraic technique that we call the merge decomposition. A prototypical application of this technique decomposes a semigroup $T$ into a two-sided semidirect product whose components are built from two subsemigroups $T_1,T_2$, which together generate $T$, and the subsemigroup generated by their setwise product $T_1T_2$. In this sense we decompose $T$ by merging the subsemigroups $T_1$ and $T_2$. More generally, our technique merges semigroup homomorphisms from free semigroups.
منابع مشابه
Pointlike sets for varieties determined by groups
For a variety of finite groups $\mathbf H$, let $\overline{\mathbf H}$ denote the variety of finite semigroups all of whose subgroups lie in $\mathbf H$. We give a characterization of the subsets of a finite semigroup that are pointlike with respect to $\overline{\mathbf H}$. Our characterization is effective whenever $\mathbf H$ has a decidable membership problem. In particular, the separation...
متن کاملAperiodic Pointlikes and Beyond
We prove that if π is a recursive set of primes, then pointlike sets are decidable for the pseudovariety of semigroups whose subgroups are π-groups. In particular, when π is the empty set, we obtain Henckell’s decidability of aperiodic pointlikes. Our proof, restricted to the case of aperiodic semigroups, is simpler than the original proof.
متن کاملA Profinite Approach to Stable Pairs
We give a short proof, using profinite techniques, that idempotent pointlikes, stable pairs and triples are decidable for the pseudovariety of aperiodic monoids. Stable pairs are also described for the pseudovariety of all finite monoids.
متن کاملOn the Cayley Semigroup of a Finite Aperiodic Semigroup
Let S be a finite semigroup. In this paper we introduce the functions φs : S ∗ → S, first defined by Rhodes, given by φs([a1, a2, . . . , an]) = [sa1, sa1a2, . . . , sa1a2 · · · an]. We show that if S is a finite aperiodic semigroup, then the semigroup generated by the functions {φs}s∈S is finite and aperiodic.
متن کاملNormal Forms for Free Aperiodic Semigroups
The implicit operation ω is the unary operation which sends each element of a finite semigroup to the unique idempotent contained in the subsemigroup it generates. Using ω there is a well-defined algebra which is known as the free aperiodic semigroup. In this article we show that for each n, the ngenerated free aperiodic semigroup is defined by a finite list of pseudoidentities and has a decida...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1708.08118 شماره
صفحات -
تاریخ انتشار 2017